منابع مشابه
Maximum Marking Problems with Accumulative Weight Functions
We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the specification to allow for weight functions with accumulation, which is particularly useful when the weight of each element depends on adjacent elements. This extension of weight functions enables us to treat more interesti...
متن کاملMmpP: Maximum Marking Problems in Parallel
Maximum marking problems (Mmp for short) are to put a mark on the entries of some given data structure in a way such that a given constraint is satisfied and the sum of the weights associated with marked entries is as large as possible. It was shown that the linear time algorithm can be obtained provided that the characterizing function of the constraint is a finite homomorphism. This paper dem...
متن کاملSimultaneous retraction and marking for maximum conchal cartilage harvest.
INTRODUCTION The three-dimensional contour of the face is defined by the osseocartilaginous framework as well as the soft tissue that surrounds these structures. In reconstructive surgery, it is important to analyze the defect and determine which layers are deficient and need replacement. Cartilage is employed extensively in aesthetic and reconstructive surgery for its capacity to be shaped as ...
متن کاملDeterministic Packet Marking for Maximum Link Price Estimation
A recently proposed congestion control algorithm, MaxNet, achieves MaxMin fairness for a variety of utilization functions. MaxNet requires every source to have information about the price – a measure of congestion – of the most congested link in the path to the sink. In this paper we describe a deterministic packet-marking algorithm which conveys the maximum link price to the source. Our algori...
متن کاملOn Maximum Rank Aggregation Problems
The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. These are expressed by permutations, whose distance can be measured in many ways. In this work we study a collection of distances, including the Kendall tau, Spearman footrule, Spearman rho, Cayley, Hamming, Ulam, and Minkowski distances, and compute the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2001
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796801004038